E-DROP: An Effective Drop Buffer Management Policy for DTN Routing Protocols

In Delay Tolerant Networks (DTN) disruptions may happen frequently as end to end path is not available all the time. Thus, delays can also be extended due to its environment nature like deep space, underwater, ocean sensor networks. In manage to achieve message delivery probability in such demanding networking situations , researchers have proposed the design of store-carry-and-forward routing protocols, here a node might accumulate a message in its buffer and carry it next to for unlimited time , awaiting till a suitable forwarding opportunity acquire .Moreover, multiple message duplication into the network to increase delivery probability. This arrangement of long-standing storage and replication force a high storage overhead on network. Therefore, efficient buffer drop policies are required to resolve on buffer, which decides messages must be dropped, while node buffers are overflow. In this paper, we propose effective buffer management drop policy E-DROP for delay tolerant networks. We illustrate that conventional buffer management policy like MOFO be unsuccessful to consider all relevant information in this framework. E-DROP policy can be adjust to minimize the metrics of relayed, dropped , average latency ,overhead ratio ,hop count and to maximize the average delivery probability and buffer time. Using simulations support on an imitation mobility models shortest path map based and Map route movements, we show that our buffer management E-DROP with random message sizes drop policy performs better as the existing MOFO. General Terms Algorithm, Routing.